منابع مشابه
Vernalization
fixity — the behavior of fossil organisms will be similar to the behavior of their extant descendants at the generic level — my wife and I re-constructed the type of Tertiary forest that existed in Hispaniola based on plants and animals in Dominican amber. We concluded that the amber forest in Hispaniola was similar to today’s tropical moist forest, but was much more diverse and contained a num...
متن کاملEquilibrium Onions ?
– We demonstrate the possibility of a stable equilibrium multi-lamellar (“onion”) phase in pure lamellar systems (no excess solvent) due to a sufficiently negative Gaussian curvature modulus. The onion phase is stabilized by non-linear elastic moduli coupled to a polydisperse size distribution (Apollonian packing) to allow space-filling without appreciable elastic distortion. This model is comp...
متن کاملDuo-Onions and Hydra-Onions - Failure and Adversary Resistant Onion Protocols
A serious weakness of the onion protocol, one of the major tools for anonymous communication, is its vulnerability to network failures and/or an adversary trying to break the communication. This is facilitated by the fact that each message is sent through a path of a certain length and a failure in a single point of this path prohibits message delivery. Since the path cannot be too short in ord...
متن کاملOnions in the Crosshairs
We introduce and investigate targeting adversaries who selectively aack users of Tor or other secure-communication networks. We argue that aacks by such adversaries are more realistic and more signicant threats to those most relying on Tor’s protection than are aacks in prior analyses of Tor security. Previous research and Tor design decisions have focused on protecting against adversaries ...
متن کاملUnions of Onions
Let D be a set of n pairwise disjoint unit disks in the plane. We describe how to build a data structure for D so that for any point set P containing exactly one point from each disk, we can quickly find the onion decomposition (convex layers) of P . Our data structure can be built in O(n log n) expected time and has linear size. Given P , we can find its onion decomposition in O(n log k) time,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1942
ISSN: 0028-0836,1476-4687
DOI: 10.1038/150689a0